منابع مشابه
Elimination schemes and lattices
Perfect vertex elimination schemes are part of the characterizations for several classes of graphs, including chordal and cop-win. Partial elimination schemes reduce a graph to an important subgraph, for example, k-cores and robber-win graphs. We are interested in those partial elimination schemes, in which once a vertex can be eliminated it is always ready to be eliminated. In such a scheme, t...
متن کاملVarious Proxy Re-Encryption Schemes from Lattices
Proxy re-encryption (PRE) was introduced by Blaze, Bleumer and Strauss [Eurocrypt ’98]. Basically, PRE allows a semi-trusted proxy to transform a ciphertext encrypted under one key into an encryption of the same plaintext under another key, without revealing the underlying plaintext. Since then, many interesting applications have been explored, and many constructions in various settings have be...
متن کاملAn equivalence functor between local vector lattices and vector lattices
We call a local vector lattice any vector lattice with a distinguished positive strong unit and having exactly one maximal ideal (its radical). We provide a short study of local vector lattices. In this regards, some characterizations of local vector lattices are given. For instance, we prove that a vector lattice with a distinguished strong unit is local if and only if it is clean with non no-...
متن کاملDirect product decompositions of lattices, closures and relation schemes
In this paper we study direct product decompositions of closure operations and lattices of closed sets. We characterize direct product decompositions of lattices of closed sets in terms of closure operations, and find those decompositions of lattices which correspond to the decompositions of closures. If a closure on a finite set is represented by its implication base (i.e. a binary relation on...
متن کاملQuantifier elimination in the theory of Lp(Lq) Banach lattices
We introduce the class of doubly atomless bands in Lp(Lq)-Banach lattices and show that this class is axiomatizable by positive bounded sentences in the language of Banach lattices. (Here p 6= q are fixed and in the interval 1 ≤ p, q < ∞ .) The theory of this class is complete (indeed, we show it is separably categorical) and model complete. Further, we show that it satisfies quantifier elimina...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2014
ISSN: 0012-365X
DOI: 10.1016/j.disc.2014.03.024